A reasonably gradual type theory
نویسندگان
چکیده
Gradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity respect to CIC. Recently, GCIC has been proposed as a parametrized gradual type theory that admits three variants, each sacrificing one these properties. For devising proof assistant based on CIC, normalization CIC are key, but tension graduality needs be addressed. Additionally, several challenges remain: (1) The presence two wildcard terms at any type---the error unknown terms---enables trivial proofs theorem, jeopardizing use in assistant; (2) Supporting general indexed inductive families, most prominently equality, is an open problem; (3) Theoretical accounts typing so far do not support handling mismatches detected during reduction; (4) Precision external notions amenable reasoning within theory. All issues manifest primally CastCIC, cast calculus used define GCIC. In this work, we present extension CastCIC called GRIP. GRIP reasonably addresses above, featuring internal precision exception handling. By adopting novel interpretation term carefully for universe levels, satisfies large well-defined class terms, addition being normalizing conservative Internal supports about itself, instance characterize exception-handling subset types. We develop metatheory using model formalized Coq, provide prototype implementation Agda.
منابع مشابه
Call-by-name Gradual Type Theory
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to new judgments for gradual type and term dynamism, which were developed in blame calculi and to state the “gradual guarantee” theorem of gradual typing. Comb...
متن کاملGradual Liquid Type Inference
We present gradual liquid type inference, a novel combination of refinement types with gradual refinements that range over a finite set of SMT-decidable predicates. This finiteness restriction allows for an algorithmic inference procedure where all possibly valid interpretations of a gradual refinement are exhaustively checked. Thanks to exhaustive searching we can detect the safe concretizatio...
متن کاملA Theory of Gradual Institutional Change
Once created, institutions often change in subtle and gradual ways over time. Although less dramatic than abrupt and wholesale transformations, these slow and piecemeal changes can be equally consequential for patterning human behavior and for shaping substantive political outcomes. Consider, for example, the British House of Lords. This is an institution that began to take shape in the thirtee...
متن کاملGradual type-and-effect systems
Effect systems have the potential to help software developers, but their practical adoption has been very limited. We conjecture that this limited adoption is due in part to the difficulty of transitioning from a system where effects are implicit and unrestricted to a system with a static effect discipline, which must settle for conservative checking in order to be decidable. To address this hi...
متن کاملReasonably Programmable Syntax
Programming languages commonly provide “syntactic sugar” that decreases the syntactic cost of working with certain standard library constructs. For example, Standard ML builds in syntactic sugar for constructing and pattern matching on lists. Third-party library providers are, justifiably, envious of this special arrangement. After all, it is not difficult to find other situations where library...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on programming languages
سال: 2022
ISSN: ['2475-1421']
DOI: https://doi.org/10.1145/3547655